n = int(input())
seats = list(map(int, input().split(' ')))
per = input()
seats_2d = []
for i in range(n):
seats_2d.append([seats[i], i+1])
seats_2d.sort(key = lambda x: -x[0] )
inv_stack = []
res = []
for p in per:
if p == '0':
_, ind = seats_2d.pop()
res.append(ind)
inv_stack.append(ind)
else:
ind = inv_stack.pop()
res.append(ind)
print(' '.join(str(i) for i in res))
468. Validate IP Address | 450. Delete Node in a BST |
445. Add Two Numbers II | 442. Find All Duplicates in an Array |
437. Path Sum III | 436. Find Right Interval |
435. Non-overlapping Intervals | 406. Queue Reconstruction by Height |
380. Insert Delete GetRandom O(1) | 332. Reconstruct Itinerary |
368. Largest Divisible Subset | 377. Combination Sum IV |
322. Coin Change | 307. Range Sum Query - Mutable |
287. Find the Duplicate Number | 279. Perfect Squares |
275. H-Index II | 274. H-Index |
260. Single Number III | 240. Search a 2D Matrix II |
238. Product of Array Except Self | 229. Majority Element II |
222. Count Complete Tree Nodes | 215. Kth Largest Element in an Array |
198. House Robber | 153. Find Minimum in Rotated Sorted Array |
150. Evaluate Reverse Polish Notation | 144. Binary Tree Preorder Traversal |
137. Single Number II | 130. Surrounded Regions |